Implementing the Simplex Method: The Initial Basis
نویسندگان
چکیده
منابع مشابه
buckling of viscoelastic composite plates using the finite strip method
در سال های اخیر، تقاضای استفاده از تئوری خطی ویسکوالاستیسیته بیشتر شده است. با افزایش استفاده از کامپوزیت های پیشرفته در صنایع هوایی و همچنین استفاده روزافزون از مواد پلیمری، اهمیت روش های دقیق طراحی و تحلیل چنین ساختارهایی بیشتر شده است. این مواد جدید از خودشان رفتارهای مکانیکی ارائه می دهند که با تئوری های الاستیسیته و ویسکوزیته، نمی توان آن ها را توصیف کرد. این مواد، خواص ویسکوالاستیک دارند....
The evaluation of basis set, method and initial geometry on structural properties of a cyclic phosphor amidate compound by SPSS
The structural properties of a new cyclic phosphor amide have been investigated in three methods and four basis sets and results have been compared with experimental data by spss. The best level for this type compound is HF/6-31++G** and with considering to this result, at this level, hyper chem input as initial geometry have been evaluated.
متن کاملImplementing the simplex method as a cutting-plane method, with a view to regularization
We show that the simplex method can be interpreted as a cutting-plane method, assumed that a special pricing rule is used. This approach is motivated by the recent success of the cutting-plane method in the solution of special stochastic programming problems. We compare the classic Dantzig pricing rule and the rule that derives from the cutting-plane approach. We focus on the special linear pro...
متن کاملParallelizing the Dual Simplex Method Parallelizing the Dual Simplex Method
We study the parallelization of the steepest-edge version of the dual simplex algorithm. Three different parallel implementations are examined, each of which is derived from the CPLEX dual simplex implementation. One alternative uses PVM, one general-purpose System V shared-memory constructs, and one the PowerC extension of C on a Silicon Graphics multi-processor. These versions were tested on ...
متن کاملA note on "an improved initial basis for the simplex algorithm"
A lot of research has been done to 1nd a faster (polynomial) algorithm that can solve linear programming (LP) problems. The main branch of this research has been devoted to interior point methods (IPM). The IPM outperforms the Simplex method in large LPs. However, there is still much research being done in order to improve pivoting algorithms. In this paper, we present a new approach to the pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORSA Journal on Computing
سال: 1992
ISSN: 0899-1499,2326-3245
DOI: 10.1287/ijoc.4.3.267